The Edge - minimal Polyhedral Maps of Euler Characteristic – 8 ∗
نویسندگان
چکیده
In [2], a {5, 5}-equivelar polyhedral map of Euler characteristic −8 was constructed. In this article we prove that {5, 5}-equivelar polyhedral map of Euler characteristic −8 is unique. As a consequence, we get that the minimum number of edges in a non-orientable polyhedral map of Euler characteristic −8 is > 40. We have also constructed {5, 5}-equivelar polyhedral map of Euler characteristic −2m for each m ≥ 4. MSC 2000: 52B70, 51M20, 57M20
منابع مشابه
Light stars in large polyhedral maps on surfaces
It is well known that every polyhedral map with large enough number of vertices contains a vertex of degree at most 6. In this paper the existence of stars having low degree sum of their vertices in polyhedral maps is investigated. We will prove: if G is a polyhedral map on compact 2-manifold M with non-positive Euler characteristic (M) and G has more than 149| (M)| vertices then G contains an ...
متن کاملLocal Structures in Polyhedral Maps on Surfaces, and Path Transferability of Graphs
We extend Jendrol’ and Skupień’s results about the local structure of maps on the 2-sphere: In this paper we show that if a polyhedral map G on a surface M of Euler characteristic χ(M) ≤ 0 has more than 126|χ(M)| vertices, then G has a vertex with ”nearly” non-negative combinatorial curvature. As a corollary of this, we can deduce that path transferability of such graphs are at most 12. keyword...
متن کاملLight paths in large polyhedral maps with prescribed minimum degree
Let k be an integer and M be a closed 2-manifold with Euler characteristic χ(M) ≤ 0. We prove that each polyhedral map G on M with minimum degree δ and large number of vertices contains a k-path P , a path on k vertices, such that: (i) for δ ≥ 4 every vertex of P has, in G, degree bounded from above by 6k − 12, k ≥ 8 (It is also shown that this bound is tight for k even and that for k odd this ...
متن کاملCan one see the shape of a network?
Traditionally, network analysis is based on local properties of vertices, like their degree or clustering, and their statistical behavior across the network in question. This paper develops an approach which is different in two respects. We investigate edge-based properties, and we define global characteristics of networks directly. The latter will provide our affirmative answer to the question...
متن کاملLight classes of generalized stars in polyhedral maps on surfaces
A generalized s-star, s ≥ 1, is a tree with a root Z of degree s; all other vertices have degree ≤ 2. Si denotes a generalized 3-star, all three maximal paths starting in Z have exactly i + 1 vertices (including Z). Let M be a surface of Euler characteristic χ(M) ≤ 0, and m(M) := b 5+ √ 49−24χ(M) 2 c. We prove: (1) Let k ≥ 1, d ≥ m(M) be integers. Each polyhedral map G on M with a k-path (on k ...
متن کامل